String Superprimitivity Test on the Reconfigurable Bus Model

String regularities such as repetition, palindrome, period, seed, square, cover, etc., have been studied extensively recently. Particularly, string regularities play an important role of applications in bioinformatics tools. For a given string, its quasiperiod is the cover with the minimum length, which can be used in the hybridization method in DNA sequencing. Many algorithms have been proposed to solve some computational problems in O(1) time on the reconfigurable bus model. In this paper, we concentrate to solve the string superprimitivity test problem on the reconfigurable bus model. And we propose a parallel algorithm in O(1) time to solve the string superprimitivity test problem on an n×n CREW reconfigurable mesh.